Analysis of Reconstructions Obtained Solving <inline-formula> <tex-math notation="LaTeX">$l^p$</tex-math></inline-formula>-Penalized Minimization Problems
نویسندگان
چکیده
منابع مشابه
l-Penalized Minimization Problems
Most of the inverse problems arising in applied electromagnetics come from an underdetermined direct problem, this is the case, for instance, of spatial resolution enhancement. This implies that no unique inverse operator exists; therefore, additional constraints must be imposed on the sought solution. When dealing with microwave remote sensing, among the possible choices, the minimum p–norm co...
متن کاملOn Approximate Horn Formula Minimization
The minimization problem for Horn formulas is to find a Horn formula equivalent to a given Horn formula, using a minimum number of clauses. A 2 1−ǫ(n)-inapproximability result is proven, which is the first inapproximability result for this problem. We also consider several other versions of Horn minimization. The more general version which allows for the introduction of new variables is known t...
متن کاملSolving Problems by Formula Manipulation in Logic and Linear Inequalities
Using formal logic, many iproblems from the general area of linear inequalities co~ be expressed in the elementary theory o f addition on the real numbers (EAR). We describe a method for eliminatit~ quantiflers in EAR which has been programmed arm demonstrate its usefulness in solving some problems related to linear programming. In the area o f mechanical mathematics this kind o f approach has ...
متن کاملThe Complexity of Boolean Formula Minimization
The Minimum Equivalent Expression problem is a natural optimization problem in the second level of the Polynomial-Time Hierarchy. It has long been conjectured to be Σ2 -complete and indeed appears as an open problem in Garey and Johnson [GJ79]. The depth-2 variant was only shown to be Σ2 -complete in 1998 [Uma98], and even resolving the complexity of the depth-3 version has been mentioned as a ...
متن کاملThe Complexity of SPP Formula Minimization
Circuit minimization is a useful procedure in the field of logic synthesis. Recently, it was proven that the minimization of (∨,∧,¬) formulae is hard for the second level of the polynomial hierarchy [BU08]. The complexity of minimizing more specialized formula models was left open, however. One model used in logic synthesis is a three-level model in which the third level is composed of parity g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Geoscience and Remote Sensing
سال: 2015
ISSN: 0196-2892,1558-0644
DOI: 10.1109/tgrs.2015.2411854